Robustness Analysis of Patchwork Watermarking Schemes
نویسندگان
چکیده
The patchwork watermarking scheme is investigated in this chapter. The performance of this algorithm in terms of imperceptibility, robustness and security has been shown to be satisfactory. Robustness of the patchwork algorithm to the curve-fitting attack and blind multipleembedding attack is presented also in this chapter. Robustness against jitter attack which is a natural enemy of this watermarking algorithm is also studied. Index Terms Patchwork Watermarking, Robustness, Curve-fitting, Jitter, Multiple-embedding.
منابع مشابه
Analysis and Improving the Security of the Scalar Costa Scheme against Known Message Attack
Unintentional attacks on watermarking schemes lead to degrade the watermarking channel, while intentional attacks try to access the watermarking channel. Therefore, watermarking schemes should be robust and secure against unintentional and intentional attacks respectively. Usual security attack on watermarking schemes is the Known Message Attack (KMA). Most popular watermarking scheme with stru...
متن کاملProposing an effective approach for Network security and multimedia documents classically using encryption and watermarking
Local binary pattern (LBP) operators, which measure the local contrast within a pixel's neighborhood, successfully applied to texture analysis, visual inspection, and image retrieval. In this paper, we recommend a semi blind and informed watermarking approach. The watermark has been built from the original image using Weber Law. The approach aims is to present a high robustness and imperceptibi...
متن کاملA survey on digital data hiding schemes: principals, algorithms, and applications
This paper investigates digital data hiding schemes. The concept of information hiding will be explained at first, and its traits, requirements, and applications will be described subsequently. In order to design a digital data hiding system, one should first become familiar with the concepts and criteria of information hiding. Having knowledge about the host signal, which may be audio, image, ...
متن کاملIntroducing Capacity Surface to Estimate Watermarking Capacity
One of the most important parameters in evaluating a watermarking algorithm is its capacity. Generally, watermarking capacity is expressed by bits per pixel (bpp) unit measure. But this measure does not show what the side effects would be on image quality, watermark robustness and capacity. In this paper we propose a three dimensional measure named Capacity surface which shows the effects of ca...
متن کاملAn SVD-based watermarking scheme for protecting rightful ownership
Digital watermarking has been proposed as a solution to the problem of copyright protection of multimedia documents in networked environments. There are two important issues that watermarking algorithms need to address. Firstly, watermarking schemes are required to provide trustworthy evidence for protecting rightful ownership; Secondly, good watermarking schemes should satisfy the requirement ...
متن کامل